The convergence of an algorithm for the reverse convex programming 一類反凸規(guī)劃算法的收斂性
The affine scaling algorithm for convex programming with linear constraints 線性約束凸規(guī)劃問題的仿尺度算法
Convex programming problem 凸規(guī)劃問題
Solving linearly constrained convex programming by potential reduction interior - point algorithm 求解線性約束凸規(guī)劃的勢下降內(nèi)點算法
Finally , the relationships between generalized set - valued variational inclusion problems and non - convex programming are studied 最后研究了廣義集值變分包含問題與非凸規(guī)劃之間的關(guān)系。
Fifthly , the parameter control methods for solving convex programming , especially linear programming and convex quadratic programming , are discussed and its convergence iv is probed 五是研究了凸規(guī)劃包括線性規(guī)劃和凸二次規(guī)劃的參數(shù)控制算法及其收斂性。
Abstract : this paper presents a new primal ? dual interior point algorithm for a convex programming with box constraints , and prove the iteration complexity is polynomial 文摘:本文為框式約束的一類凸規(guī)劃提出了一個新的內(nèi)點算法,原始-對偶路徑跟蹤法,并證明了算法的迭代復(fù)雜性為多項式時間性
The mathematical programming methods , both the method of moving asymptotes ( mma ) belonging to convex programming methods and the sequential linear programming method ( slp ) , were used to solving optimization problems 用移動漸進線方法( mma )求解單目標優(yōu)化問題,用序列線性規(guī)劃方法( slp )求解模糊目標混合規(guī)劃問題。
Finally , prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem 最后,還證明了得到的凹規(guī)劃和反凸規(guī)劃的全局最優(yōu)解就是原問題的近似全局最優(yōu)解。
Abstract : an algorithm of indefinite quadratic programming over unbound domain is presented ; the indefi nite quadratic programming is translated into a series of convex programming and the convergence of algorithm is discussed 文摘:給出了無界域上不定二次規(guī)劃的一個算法,該算法將不定二次規(guī)劃轉(zhuǎn)化為一系列凸二次規(guī)劃,并證明了算法的收斂性